IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Switch Codes: Codes for Fully Parallel Reconstruction

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES LDPC Codes for Two- Dimensional Arrays

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Burst-Erasure Correcting Codes with Optimal Average Delay

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES On-Line Fountain Codes with Low Overhead

An on-line fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper we formalize the problem of on-line fountain code construction, and propose new on-line fountain codes that outperform known ones in having factor 3-5 l...

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Performance Bounds for Erasure, List and Feedback Schemes with Linear Block Codes

A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted over memoryless symmetric channels. Similarly to the classical work of Forney, this work is focused on the derivation of some Gallager-type bounds on the achievable tradeoffs for these coding schemes, where the main no...

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES On the Statistical Physics of Directed Polymers in a Random Medium and Their Relation to Tree-Structed Lossy Compression

Using well–known results from statistical physics, concerning the almost–sure behavior of the free energy of directed polymers in a random medium, we prove that a certain ensemble of tree–structured rate–distortion codes with delayless decoding, asymptotically achieves the rate–distortion function under a certain symmetry condition.